A Fast and Stable Cluster Labeling Method for Support Vector Clustering
نویسنده
چکیده
Even though support vector clustering (SVC) is able to handle arbitrary cluster shapes effectively, its popularity is frequently degraded by highly intensive time complexity, poor label performance and even instability for efficiency. To overcome such problems, a fast and stable cluster labeling (FSCL) method is proposed. Based on stable equilibrium points, the FSCL first finds an appropriate division of support vectors. With a nonlinear sample sequence strategy presented here, the connected components profiled by support vectors (SVs) can be determined in terms of sampling all stable equilibrium point pairs; and the FSCL prefers a density centroid constructed by one subset of SVs, along with a stable equilibrium point, to represent a component while avoiding local optimization. Finally, the remaining data points can be assigned the label of the nearest components with respect to a weighted distance. Time complexity analysis and comparative experiments suggest that the FSCL improves both the efficiency and clustering quality significantly while guaranteeing stability.
منابع مشابه
Cone Cluster Labeling for Support Vector Clustering
Clustering forms natural groupings of data points that maximize intra-cluster similarity and minimize intercluster similarity. Support Vector Clustering (SVC) is a clustering algorithm that can handle arbitrary cluster shapes. One of the major SVC challenges is a cluster labeling performance bottleneck. We propose a novel cluster labeling algorithm that relies on approximate coverings both in f...
متن کاملModification of the Fast Global K-means Using a Fuzzy Relation with Application in Microarray Data Analysis
Recognizing genes with distinctive expression levels can help in prevention, diagnosis and treatment of the diseases at the genomic level. In this paper, fast Global k-means (fast GKM) is developed for clustering the gene expression datasets. Fast GKM is a significant improvement of the k-means clustering method. It is an incremental clustering method which starts with one cluster. Iteratively ...
متن کاملA Novel Scheme for Accelerating Support Vector Clustering
Limited by two time-consuming steps, solving the optimization problem and labeling the data points with cluster labels, the support vector clustering (SVC) based algorithms, perform ineffectively in processing large datasets. This paper presents a novel scheme aimed at solving these two problems and accelerating the SVC. Firstly, an innovative definition of noise data points is proposed which c...
متن کاملStock Price Prediction using Machine Learning and Swarm Intelligence
Background and Objectives: Stock price prediction has become one of the interesting and also challenging topics for researchers in the past few years. Due to the non-linear nature of the time-series data of the stock prices, mathematical modeling approaches usually fail to yield acceptable results. Therefore, machine learning methods can be a promising solution to this problem. Methods: In this...
متن کاملDensity Clustering Based SVM and Its Application to Polyadenylation Signals∗
Support vector machines (SVM) have been promising methods for classification analysis due to their solid mathematical foundations. Clustering-based SVMs are used to solve large samples classification problems and reduce the computational cost. In this paper, we present a density clustering based SVM(DCB-SVM) method to predict polyadenylation signal (PAS) in human DNA and mRNA sequences. We decr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- JCP
دوره 8 شماره
صفحات -
تاریخ انتشار 2013